Global existence and asymptotic behavior for a multidimensional nonisentropic hydrodynamic semiconductor model with the heat source

In this paper, a multidimensional nonisentropic hydrodynamic model for semiconductors with the nonconstant lattice temperature is studied. The model is self-consistent in the sense that the electric field, which forms a forcing term in the momentum equation, is determined by the coupled Poisson equation. Global existence to the Cauchy problem for the multidimensional nonisentropic hydrodynamic semiconductor model with the small perturbed initial data is established, and the asymptotic behavior of these smooth solutions is investigated, namely, that the solutions converge to the general steady-state solution exponentially fast as t→+∞ is obtained. Moreover, the existence and uniqueness of the stationary solutions are investigated.     

THE SATELLITE STRUCTURE TOPOLOGY OPTIMIZATION BASED ON HOMOGENIZATION METHOD AND ITS SIZE SENSITIVITY ANALYSIS

With the development of satellite structure technology, more and more design parameters will affect its structural performance. It is desirable to obtain an optimal structure design with a minimum weight, including optimal configuration and sizes. The present paper aims to describe an optimization analysis for a satellite structure, including topology optimization and size optimization. Based on the homogenization method, the topology optimization is carried out for the main supporting frame of service module under given constraints and load conditions, and then the sensitivity analysis is made of 15 structural size parameters of the whole satellite and the optimal sizes are obtained. The numerical result shows that the present optimization design method is very effective.     

Variance reduction in sample approximations of stochastic programs

This paper studies the use of randomized Quasi-Monte Carlo methods (RQMC) in sample approximations of stochastic programs. In numerical integration, RQMC methods often substantially reduce the variance of sample approximations compared to Monte Carlo (MC). It seems thus natural to use RQMC methods in sample approximations of stochastic programs. It is shown, that RQMC methods produce epi-convergent approximations of the original problem. RQMC and MC methods are compared numerically in five different portfolio management models. In the tests, RQMC methods outperform MC sampling substantially reducing the sample variance and bias of optimal values in all the considered problems.     

Stress-based upper-bound method and convex optimization: case of the Gurson materialMéthode cinématique par les contraintes et optimisation convexe : cas du matériau de Gurson

A nonlinear interior point method associated with the kinematic theorem of limit analysis is proposed. Associating these two tools enables one to determine an upper bound of the limit loading of a Gurson material structure from the knowledge of the sole yield criterion. We present the main features of the interior point algorithm and an original method providing a rigorous kinematic bound from a stress formulation of the problem. This method is tested by solving in plane strain the problem of a Gurson infinite bar compressed between rough rigid plates. To cite this article: F. Pastor et al., C. R. Mecanique 334 (2006).     

Vector Ordinal Optimization

Ordinal optimization is a tool to reduce the computational burden in simulation-based optimization problems. So far, the major effort in this field focuses on single-objective optimization. In this paper, we extend this to multiobjective optimization and develop vector ordinal optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve (OPC) are redefined for multiobjective optimization. Our results lead to quantifiable subset selection sizes in the multiobjective case, which supplies guidance in solving practical problems, as demonstrated by the examples in this paper.This paper was supported in part by Army Contract DAAD19-01-1-0610, AFOSR Contract F49620-01-1-0288, and a contract with United Technology Research Center (UTRC). The first author received additional funding from NSF of China Grants 60074012 and 60274011, Ministry of Education (China), and a Tsinghua University (Beijing, China) Fundamental Research Funding Grant, and the NCET program of China.The authors are grateful to and benefited from two rounds of reviews from three anonymous referees.     

Simple global minimization algorithm for one-variable rational functions

Sturm's chain technique for evaluation of a number of real roots of polynomials is applied to construct a simple algorithm for global optimization of polynomials or generally for rational functions of finite global minimal value. The method can be applied both to find the global minimum in an interval or without any constraints. It is shown how to use the method to minimize globally a truncated Fourier series. The results of numerical tests are presented and discussed. The cost of the method scales as the square of the degree of the polynomial.     

Automated optimization of split ratio in capillary gas chromatography

An electronic gas-flow controller system called Advanced Flow Control (AFC), which controls not only carrier gas pressure at the column inlet but also the total gas flow including the split flow, was designed and evaluated. BASIC programming of repetitive analyses of standard mixtures under varied split ratios and pressure programs allowed automated optimization of those conditions for the desired column loading and resolution between adjacent peaks.     

Min-Max Optimization of Several Classical Discrete Optimization Problems

In this paper, we study discrete optimization problems with min-max objective functions. This type of problems has direct applications in the recent development of robust optimization. The following well-known classes of problems are discussed: minimum spanning tree problem, resource allocation problem with separable cost functions, and production control problem. Computational complexities of the corresponding min-max version of the above-mentioned problems are analyzed. Pseudopolynomial algorithms for these problems are provided under certain conditions.     

An Equivalent Theorem on Connectedness of the Weakly Cone-Efficient Sets

利用连通集上有关上半连续点集映射的连通性质，本文证明了拓扑向量空间中向量最优化问题的弱锥－有效解集与相应目标空间中的弱锥－有效点集连通性之间的一个等价定理．     

A General Duality Scheme for Nonconvex Minimization Problems with a Strict Inequality Constraint

We establish a duality formula for the problem Minimize f(x)+g(x) for h(x)+k(x)<0 where g, k are extended-real-valued convex functions and f, h belong to the class of functions that can be written as the lower envelope of an arbitrary family of convex functions. Applications in d.c. and Lipschitzian optimization are given.